Non-uniform mixing of quantum walk on cycles
نویسندگان
چکیده
A classical lazy random walk on cycles is known to mix to the uniform distribution. In contrast, we show that a continuous-time quantum walk on cycles exhibit strong non-uniform mixing properties. Our results include the following: • The instantaneous distribution of a quantum walk on most even-length cycles is never uniform. More specifically, we prove that a quantum walk on a cycle Cn is not instantaneous uniform mixing, whenever n satisfies either: (a) n = 2u, for u ≥ 3; or (b) n = 2uq, for u ≥ 1 and q ≡ 3 (mod 4). • The average distribution of a quantum walk on any Abelian circulant graph is never uniform. As a corollary, the average distribution of a quantum walk on any standard circulant graph, such as the cycles, complete graphs, and even hypercubes, is never uniform. Nevertheless, we show that the average distribution of a quantum walk on the cycle Cn is O(1/n)-uniform.
منابع مشابه
Mixing in Continuous Quantum Walks on Graphs
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs th...
متن کاملMixing of quantum walk on circulant bunkbeds
We give new observations on the mixing dynamics of a continuous-time quantum walk on circulants and their bunkbed extensions. These bunkbeds are defined through two standard graph operators: the join G + H and the Cartesian product G ⊕ H of graphs G and H . Our results include the following: • The quantum walk is average uniform mixing on circulants with bounded eigenvalue multiplicity. This ex...
متن کاملUniversal mixing of quantum walk on graphs
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph is uniform mixing if it visits the uniform distribut...
متن کاملua nt - p h / 06 08 04 4 v 1 4 A ug 2 00 6 Universal Mixing of Quantum Walk on Graphs ∗
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph is uniform mixing if it visits the uniform distribut...
متن کاملMixing Times in Quantum Walks on the Hypercube
The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean probability distribution of a discrete-time quantum walk on a hypercube mixes to a (generally non-uniform) distribution π(x) in time O(n) and the stationary distribut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007